Competence guided incremental footprint-based retrieval

نویسندگان

  • Barry Smyth
  • Elizabeth McKenna
چکیده

Case-based reasoning (CBR) systems solve new problems by retrieving and adapting problem solving experiences stored as cases in a case-base. Success depends largely on the performance of the case retrieval algorithm used. Smyth and McKenna [Lecture Notes in Arti®cial Intelligence LNAI 1650 (1999) 343±357] have described a novel retrieval technique, called footprint-based retrieval (FBR), which is guided by a model of case competence. FBR as it stands bene®ts from superior ef®ciency characteristics and achieves near-optimal competence and quality characteristics. In this paper, we describe a simple but important extension to FBR. Empirically we show that this new algorithm can deliver optimal retrieval performance while at the same time retaining the ef®ciency bene®ts of the original FBR method. q 2001 Elsevier Science B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Footprint-Based Retrieval

The success of a case-based reasoning system depends critically on the performance of the retrieval algorithm used and, specifically, on its efficiency, competence, and quality characteristics. In this paper we describe a novel retrieval technique that is guided by a model of case competence and that, as a result, benefits from superior efficiency, competence and quality features.

متن کامل

Maintaining Footprint-Based Retrieval for Case Deletion

The effectiveness and efficiency of case-based reasoning (CBR) systems depend largely on the success of case-based retrieval. The case-base maintenance (CBM) issues become imperative and important especially for modern societies. This paper proposes a new competence model and a new maintenance procedure for the proposed competence model. Based on the proposed competence maintenance procedure, f...

متن کامل

The FAR-OFF System: A Heuristic Search Case-Based Planning

This paper presents a case-based planning system, called FAR-OFF, as an alternative approach to heuristic search generative planners, like HSP and FF. The FAR-OFF system introduces the use of a new similarity metric, called ADG (Action Distance-Guided), that is more accurate than other similarity metrics, and it also incorporates techniques to decrease the retrieval time, like the Footprint-bas...

متن کامل

Case Based Reasoning with Bayesian Model Averaging: An Improved Method for Survival Analysis on Microarray Data

The Utility Problem for Lazy Learners Towards a Non-eager Approach p. 141 EGAL: Exploration Guided Active Learning for TCBR p. 156 Introspective Knowledge Revision in Textual Case-Based Reasoning p. 171 A General Introspective Reasoning Approach to Web Search for Case Adaptation p. 186 Detecting Change via Competence Model p. 201 CBTV: Visualising Case Bases for Similarity Measure Design and Se...

متن کامل

Hybrid Technique and Competence- Preserving Case Deletion Methods for Case Maintenance in Case-Based Reasoning

Case-Based Reasoning (CBR) is one of machine learning algorithms for problem solving and learning that caught a lot of attention over the last few years. In general, CBR is composed of four main phases: retrieve the most similar case or cases, reuse the case to solve the problem, revise or adapt the proposed solution, and retain the learned cases before returning them to the case base for learn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Knowl.-Based Syst.

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2001